%% This BibTeX bibliography file was created using BibDesk.
%% http://bibdesk.sourceforge.net/


%% Created for Edo Liberty at 2014-07-07 16:32:26 -0400 


%% Saved with string encoding Unicode (UTF-8) 



@inproceedings{Sarlos06,
	Author = {Tam{\'a}s Sarl{\'o}s},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {FOCS},
	Crossref = {DBLP:conf/focs/2006},
	Date-Added = {2014-07-07 19:56:50 +0000},
	Date-Modified = {2014-07-07 19:56:56 +0000},
	Ee = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2006.37},
	Pages = {143-152},
	Title = {Improved Approximation Algorithms for Large Matrices via Random Projections},
	Year = {2006}}

@proceedings{DBLP:conf/focs/2006,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {FOCS},
	Date-Added = {2014-07-07 19:56:50 +0000},
	Date-Modified = {2014-07-07 19:56:50 +0000},
	Isbn = {0-7695-2720-5},
	Publisher = {IEEE Computer Society},
	Title = {47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
	Year = {2006}}

@article{HalkoMT11,
	Author = {Nathan Halko and Per-Gunnar Martinsson and Joel A. Tropp},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2014-07-03 22:39:41 +0000},
	Date-Modified = {2014-07-03 22:39:50 +0000},
	Ee = {http://dx.doi.org/10.1137/090771806},
	Journal = {SIAM Review},
	Number = {2},
	Pages = {217-288},
	Title = {Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions},
	Volume = {53},
	Year = {2011}}

@article{JohnsonLindenstrauss84,
	Author = {W.B.~Johnson and J.~Lindenstrauss},
	Date-Added = {2014-07-03 16:22:08 +0000},
	Date-Modified = {2014-07-03 16:22:08 +0000},
	Journal = {Contemp. Math.},
	Pages = {189--206},
	Title = {Extensions of {L}ipschitz mappings into a {H}ilbert space},
	Volume = {26},
	Year = {1984}}

@techreport{GuptaDasgupta06,
	Address = {Berkeley, CA},
	Author = {Sanjoy Dasgupta and Anupam Gupta},
	Date-Added = {2014-07-01 06:53:16 +0000},
	Date-Modified = {2014-07-01 06:53:16 +0000},
	Number = {TR-99-006},
	Title = {An elementary proof of the Johnson-Lindenstrauss Lemma},
	Url = {citeseer.ist.psu.edu/dasgupta99elementary.html},
	Year = {1999},
	Bdsk-Url-1 = {citeseer.ist.psu.edu/dasgupta99elementary.html}}

@article{Achlioptas03,
	Address = {Orlando, FL, USA},
	Author = {Dimitris Achlioptas},
	Date-Added = {2014-07-01 06:52:21 +0000},
	Date-Modified = {2014-07-01 06:52:21 +0000},
	Doi = {http://dx.doi.org/10.1016/S0022-0000(03)00025-4},
	Issn = {0022-0000},
	Journal = {J. Comput. Syst. Sci.},
	Number = {4},
	Pages = {671--687},
	Publisher = {Academic Press, Inc.},
	Title = {Database-friendly random projections: Johnson-Lindenstrauss with binary coins},
	Volume = {66},
	Year = {2003},
	Bdsk-Url-1 = {http://dx.doi.org/10.1016/S0022-0000(03)00025-4}}

@article{stange2009efficient,
	Author = {Stange, Peter},
	Title = {On the Efficient Update of the Singular Value Decomposition Subject to Rank-One Modifications},
	Year = {2009}}

@article{gu1994stable,
	Author = {Gu, Ming and Eisenstat, Stanley C},
	Journal = {SIAM Journal on Matrix Analysis and Applications},
	Number = {4},
	Pages = {1266--1276},
	Publisher = {SIAM},
	Title = {A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem},
	Volume = {15},
	Year = {1994}}

@book{dunteman1989principal,
	Author = {Dunteman, George H},
	Number = {69},
	Publisher = {Sage},
	Title = {Principal components analysis},
	Year = {1989}}

@inproceedings{ClarksonW13,
	Author = {Kenneth L. Clarkson and David P. Woodruff},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {STOC},
	Crossref = {DBLP:conf/stoc/2013},
	Date-Added = {2014-02-19 10:58:23 +0000},
	Date-Modified = {2014-02-19 10:58:39 +0000},
	Ee = {http://doi.acm.org/10.1145/2488608.2488620},
	Pages = {81-90},
	Title = {Low rank approximation and regression in input sparsity time},
	Year = {2013}}

@inproceedings{NieKW13,
	Author = {Jiazhong Nie and Wojciech Kotlowski and Manfred K. Warmuth},
	Booktitle = {ALT},
	Date-Added = {2014-02-19 04:12:32 +0000},
	Date-Modified = {2014-02-19 04:13:01 +0000},
	Pages = {98-112},
	Title = {Online PCA with Optimal Regrets},
	Year = {2013}}

@misc{Warmuth07randomizedonline,
	Author = {Manfred K. Warmuth and Dima Kuzmin},
	Date-Added = {2014-02-19 04:09:50 +0000},
	Date-Modified = {2014-02-19 04:09:50 +0000},
	Title = {Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension},
	Year = {2007}}

@article{tygert07PNAS,
	Author = {Edo Liberty and Franco Woolfe and Per-Gunnar Martinsson and Vladimir Rokhlin and Mark Tygert},
	Date-Added = {2014-02-19 03:25:17 +0000},
	Date-Modified = {2014-02-19 03:25:17 +0000},
	Journal = {Proceedings of the National Academy of Sciences,},
	Month = {December},
	Number = {51},
	Pages = {20167-20172},
	Title = {Randomized algorithms for the low-rank approximation of matrices},
	Volume = {104},
	Year = {2007}}

@article{RudelsonVershyninMatrixSampling2007,
	Acmid = {1255449},
	Address = {New York, NY, USA},
	Articleno = {21},
	Author = {Rudelson, Mark and Vershynin, Roman},
	Date-Added = {2014-02-19 03:25:07 +0000},
	Date-Modified = {2014-02-19 03:25:07 +0000},
	Doi = {10.1145/1255443.1255449},
	Issn = {0004-5411},
	Issue_Date = {July 2007},
	Journal = {J. ACM},
	Keywords = {Monte-Carlo methods, Randomized algorithms, low-rank approximations, massive data sets, singular-value decompositions},
	Month = jul,
	Number = {4},
	Publisher = {ACM},
	Title = {Sampling from large matrices: An approach through geometric functional analysis},
	Url = {http://doi.acm.org/10.1145/1255443.1255449},
	Volume = {54},
	Year = {2007},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/1255443.1255449},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/1255443.1255449}}

@misc{Oliviera2010,
	Author = {Roberto Imbuzeiro Oliveira},
	Date-Added = {2014-02-19 03:25:00 +0000},
	Date-Modified = {2014-02-19 03:25:00 +0000},
	Howpublished = {arXiv:1004.3821v1},
	Month = {April},
	Title = {Sums of random Hermitian matrices and an inequality by Rudelson},
	Year = {2010}}

@inproceedings{FriezeKannanVempala1998,
	Acmid = {796408},
	Address = {Washington, DC, USA},
	Author = {Frieze, Alan and Kannan, Ravi and Vempala, Santosh},
	Booktitle = {Proceedings of the 39th Annual Symposium on Foundations of Computer Science},
	Date-Added = {2014-02-19 03:24:31 +0000},
	Date-Modified = {2014-02-19 03:24:31 +0000},
	Isbn = {0-8186-9172-7},
	Pages = {370--},
	Publisher = {IEEE Computer Society},
	Series = {FOCS '98},
	Title = {Fast Monte-Carlo Algorithms for finding low-rank approximations},
	Url = {http://dl.acm.org/citation.cfm?id=795664.796408},
	Year = {1998},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=795664.796408}}

@inproceedings{DrineasKannan2003,
	Acmid = {644147},
	Address = {Philadelphia, PA, USA},
	Author = {Drineas, Petros and Kannan, Ravi},
	Booktitle = {Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms},
	Date-Added = {2014-02-19 03:24:17 +0000},
	Date-Modified = {2014-02-19 03:24:17 +0000},
	Isbn = {0-89871-538-5},
	Location = {Baltimore, Maryland},
	Numpages = {10},
	Pages = {223--232},
	Publisher = {Society for Industrial and Applied Mathematics},
	Series = {SODA '03},
	Title = {Pass efficient algorithms for approximating large matrices},
	Url = {http://dl.acm.org/citation.cfm?id=644108.644147},
	Year = {2003},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=644108.644147}}

@misc{Drineas03passefficient,
	Author = {Petros Drineas and Ravi Kannan},
	Date-Added = {2014-02-19 03:24:05 +0000},
	Date-Modified = {2014-02-19 03:24:05 +0000},
	Title = {Pass Efficient Algorithms for Approximating Large Matrices},
	Year = {2003}}

@inproceedings{DeshpandeV06,
	Author = {Amit Deshpande and Santosh Vempala},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {APPROX-RANDOM},
	Crossref = {DBLP:conf/approx/2006},
	Date-Added = {2014-02-19 03:23:59 +0000},
	Date-Modified = {2014-02-19 03:23:59 +0000},
	Ee = {http://dx.doi.org/10.1007/11830924_28},
	Pages = {292-303},
	Title = {Adaptive Sampling and Fast Low-Rank Matrix Approximation},
	Year = {2006}}

@inproceedings{BoutsidisDrineasMagdon2011,
	Acmid = {2082967},
	Address = {Washington, DC, USA},
	Author = {Boutsidis, Christos and Drineas, Petros and Magdon-Ismail, Malik},
	Booktitle = {Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science},
	Date-Added = {2014-02-19 03:23:44 +0000},
	Date-Modified = {2014-02-19 03:23:44 +0000},
	Doi = {10.1109/FOCS.2011.21},
	Isbn = {978-0-7695-4571-4},
	Keywords = {low-rank matrix approximation, subset selection, SVD, approximate SVD, spectral sparsification},
	Numpages = {10},
	Pages = {305--314},
	Publisher = {IEEE Computer Society},
	Series = {FOCS '11},
	Title = {Near Optimal Column-Based Matrix Reconstruction},
	Url = {http://dx.doi.org/10.1109/FOCS.2011.21},
	Year = {2011},
	Bdsk-Url-1 = {http://dx.doi.org/10.1109/FOCS.2011.21}}

@inproceedings{BoutsidisMahoneyDrineas2009,
	Acmid = {1496875},
	Address = {Philadelphia, PA, USA},
	Author = {Boutsidis, Christos and Mahoney, Michael W. and Drineas, Petros},
	Booktitle = {Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms},
	Date-Added = {2014-02-19 03:23:44 +0000},
	Date-Modified = {2014-02-19 03:23:44 +0000},
	Location = {New York, New York},
	Numpages = {10},
	Pages = {968--977},
	Publisher = {Society for Industrial and Applied Mathematics},
	Series = {SODA '09},
	Title = {An improved approximation algorithm for the column subset selection problem},
	Url = {http://dl.acm.org/citation.cfm?id=1496770.1496875},
	Year = {2009},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=1496770.1496875}}

@inproceedings{AJL02,
	Acmid = {842791},
	Address = {Washington, DC, USA},
	Author = {Artac, Matej and Jogan, Matja" and Leonardis, Ale"},
	Booktitle = {Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3},
	Date-Added = {2014-02-19 03:17:39 +0000},
	Date-Modified = {2014-02-19 03:17:58 +0000},
	Isbn = {0-7695-1695-X},
	Pages = {30781--},
	Publisher = {IEEE Computer Society},
	Series = {ICPR '02},
	Title = {Incremental PCA or On-Line Visual Learning and Recognition},
	Url = {http://dl.acm.org/citation.cfm?id=839291.842791},
	Year = {2002},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=839291.842791}}

@incollection{BDF13,
	Author = {Balsubramani, Akshay and Dasgupta, Sanjoy and Freund, Yoav},
	Booktitle = {Advances in Neural Information Processing Systems 26},
	Date-Added = {2014-02-19 03:12:51 +0000},
	Date-Modified = {2014-02-19 03:13:08 +0000},
	Editor = {C.J.C. Burges and L. Bottou and M. Welling and Z. Ghahramani and K.Q. Weinberger},
	Pages = {3174--3182},
	Title = {The Fast Convergence of Incremental PCA},
	Url = {http://papers.nips.cc/paper/5132-the-fast-convergence-of-incremental-pca.pdf},
	Year = {2013},
	Bdsk-Url-1 = {http://papers.nips.cc/paper/5132-the-fast-convergence-of-incremental-pca.pdf}}

@incollection{MCJ13,
	Author = {Mitliagkas, Ioannis and Caramanis, Constantine and Jain, Prateek},
	Booktitle = {Advances in Neural Information Processing Systems 26},
	Date-Added = {2014-02-19 03:07:12 +0000},
	Date-Modified = {2014-02-19 03:07:25 +0000},
	Editor = {C.J.C. Burges and L. Bottou and M. Welling and Z. Ghahramani and K.Q. Weinberger},
	Pages = {2886--2894},
	Title = {Memory Limited, Streaming PCA},
	Url = {http://papers.nips.cc/paper/5035-memory-limited-streaming-pca.pdf},
	Year = {2013},
	Bdsk-Url-1 = {http://papers.nips.cc/paper/5035-memory-limited-streaming-pca.pdf}}

@incollection{ACS13,
	Author = {Arora, Raman and Cotter, Andy and Srebro, Nati},
	Booktitle = {Advances in Neural Information Processing Systems 26},
	Date-Added = {2014-02-19 03:03:29 +0000},
	Date-Modified = {2014-02-19 03:05:37 +0000},
	Editor = {C.J.C. Burges and L. Bottou and M. Welling and Z. Ghahramani and K.Q. Weinberger},
	Pages = {1815--1823},
	Title = {Stochastic Optimization of PCA with Capped MSG},
	Url = {http://papers.nips.cc/paper/5033-stochastic-optimization-of-pca-with-capped-msg.pdf},
	Year = {2013},
	Bdsk-Url-1 = {http://papers.nips.cc/paper/5033-stochastic-optimization-of-pca-with-capped-msg.pdf}}

@inproceedings{Liberty13,
	Author = {Edo Liberty},
	Booktitle = {KDD},
	Pages = {581-588},
	Title = {Simple and deterministic matrix sketching},
	Year = {2013}}

@inproceedings{Phillips14,
	Author = {Mina Ghashami and Jeff M. Phillips},
	Booktitle = {SODA},
	Title = {Relative Errors for Deterministic Low-Rank Matrix Approximations},
	Year = {2014}}

@inproceedings{clarkson2009numerical,
	Author = {Clarkson, Kenneth L and Woodruff, David P},
	Booktitle = {Proceedings of the 41st annual ACM symposium on Theory of computing},
	Organization = {ACM},
	Pages = {205--214},
	Title = {Numerical linear algebra in the streaming model},
	Year = {2009}}
